翻訳と辞書 |
Freivalds' algorithm : ウィキペディア英語版 | Freivalds' algorithm Freivalds' algorithm (named after Rusins Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication. Given three ''n'' × ''n'' matrices ''A'', ''B'', and ''C'', a general problem is to verify whether ''A'' × ''B'' = ''C''. A naïve algorithm would compute the product ''A'' × ''B'' explicitly and compare term by term whether this product equals ''C''. However, the best known matrix multiplication algorithm runs in O(''n''2.3729) time.〔(【引用サイトリンク】title=Breaking the Coppersmith-Winograd barrier )〕 Freivalds' algorithm utilizes randomization in order to reduce this time bound to O(''n''2) 〔 〕 with high probability. In O(kn2) time the algorithm can verify a matrix product with probability of failure less than . ==The algorithm==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Freivalds' algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|